Search results for "discrete [space-time]"

showing 10 items of 2035 documents

Estimation of Vegetation Structure Parameters From SMAP Radar Intensity Observations

2021

In this article, we present a multipolarimetric estimation approach for two model-based vegetation structure parameters (shape A and orientation distribution ψ of the main canopy elements). The approach is based on a reduced observation set of three incoherent (no phase information) polarimetric backscatter intensities (|S HH | 2 , |S HV | 2 , and |S VV | 2 ) combined with a two-parameter (A P and ψ) discrete scatterer model of vegetation. The objective is to understand whether this confined set of observations contains enough information to estimate the two vegetation structure parameters from the L-band radar signals. In order to disentangle soil and vegetation scattering influences on th…

Backscatter:Enginyeria de la telecomunicació::Radiocomunicació i exploració electromagnètica::Radar [Àrees temàtiques de la UPC]Incoherent scatterSynthetic aperture radarGeometryvegetation modelPhysics::GeophysicsBackscatterScatteringPolarimetryddc:550vegetation structureVegetacióDiscrete scattererElectrical and Electronic EngineeringpolarimetryVegetation mappingPhysicsRadarScatteringscatteringShapeOrder (ring theory)PlantsOrientation (vector space)DipoleVegetation structureDistribution (mathematics)Soil Moisture Active Passive (SMAP)Vegetation modelGeneral Earth and Planetary SciencesEstimationIntensity (heat transfer)radarIEEE Transactions on Geoscience and Remote Sensing
researchProduct

Representable and Continuous Functionals on Banach Quasi *-Algebras

2017

In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable functionals in Banach and Hilbert quasi *-algebras. Some other concepts related to representable functionals (full-representability, *-semisimplicity, etc) are revisited in these special cases. In particular, in the case of Hilbert quasi *-algebras, which are shown to be fully representable, the existence of a 1-1 correspondence between positive, bounded elements (defined in an appropriate way) and continuous representable functionals is proved.

Banach quasi *-algebraGeneral MathematicsHilbert quasi01 natural sciencesRepresentable functionalsAutomatic continuity of representable functional0103 physical sciencesFOS: MathematicsMathematics (all)Banach quasi0101 mathematicsOperator Algebras (math.OA)MathematicsDiscrete mathematics010102 general mathematicsMathematics - Operator AlgebrasRegular polygonAutomatic continuity of representable functionalsFunctional Analysis (math.FA)Mathematics - Functional AnalysisAutomatic continuity of representable functionals; Banach quasi; Hilbert quasi; Representable functionals; MathematicsRepresentable functionalBounded functionHilbert quasi *-algebra010307 mathematical physicsMathematicsMediterranean Journal of Mathematics
researchProduct

An attempt to realise the constrained search approach in the density functional theory

2001

Abstract The problem of reconstruction of wave functions from a given electron density is considered. A reformulation of the problem is proposed which is based on the Fourier transform. Arising mathematical problems are studied, namely, the properties of reduced spatial densities and their Fourier images are obtained, which follow from known properties of the wave functions. The proposed approach may provide a practical implementation of the Constrained Search Approach to the DFT.

BandlimitingPhysicssymbols.namesakeDiscrete Fourier transform (general)Fourier transformComputational chemistryFourier analysisDiscrete-time Fourier transformMathematical analysisFourier opticssymbolsWave functionFractional Fourier transform
researchProduct

Chiral/Achiral Copolymers of Biphenylylacetylenes Bearing Various Substituents: Chiral Amplification through Copolymerization, Followed by Enhancemen…

2020

A series of dynamic helical homo- and copolymers of chiral and/or achiral biphenylylacetylenes (PBPAs) bearing achiral methoxymethoxy or acetyloxy groups at the 2,2′-positions along with a chiral o...

Bearing (mechanical)Materials sciencePolymers and PlasticsOrganic Chemistry02 engineering and technology010402 general chemistry021001 nanoscience & nanotechnology01 natural sciencesHelicityInversion (discrete mathematics)0104 chemical scienceslaw.inventionInorganic ChemistryCrystallographylawMaterials ChemistryCopolymer0210 nano-technologyMacromoleculeMacromolecules
researchProduct

Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform

2014

Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/926170 A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the sing…

BiometricsArticle SubjectGeneral MathematicsIris recognitionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONEngineering (all)Robustness (computer science)Computer Science::MultimediaDiscrete cosine transformMathematics (all)Computer visionDigital watermarkingTransform codingMathematicsComputer Science::Cryptography and Securitybusiness.industrylcsh:MathematicsVDP::Technology: 500::Mechanical engineering: 570General EngineeringWatermarkVDP::Technology: 500::Information and communication technology: 550lcsh:QA1-939ComputingMethodologies_PATTERNRECOGNITIONlcsh:TA1-2040Computer Science::Computer Vision and Pattern RecognitionArtificial intelligencebusinesslcsh:Engineering (General). Civil engineering (General)BCH codeMathematics (all); Engineering (all)Mathematical Problems in Engineering
researchProduct

On the lattice of prefix codes

2002

AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.

Block codeDiscrete mathematicsPrefix codeGeneral Computer ScienceRational languagesJoinsKraft's inequalityDecidabilityTheoretical Computer SciencePrefixCombinatoricsLattice (order)Computer Science::Formal Languages and Automata TheoryMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

On the decomposition of prefix codes

2017

Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.

Block codePrefix codeGeneral Computer ScienceComputer science0102 computer and information sciences02 engineering and technologyPrefix grammarKraft's inequality01 natural sciencesPrefix codeTheoretical Computer SciencePrefix codes; Finite automata; Composition of codesComposition of codes0202 electrical engineering electronic engineering information engineeringDiscrete mathematicsSelf-synchronizing codeFinite-state machineSettore INF/01 - InformaticaComputer Science (all)Rational languageLinear codePrefixComposition of code010201 computation theory & mathematicsPrefix codes020201 artificial intelligence & image processingFinite automataComputer Science::Formal Languages and Automata Theory
researchProduct

Uniqueness of diffusion on domains with rough boundaries

2016

Let $\Omega$ be a domain in $\mathbf R^d$ and $h(\varphi)=\sum^d_{k,l=1}(\partial_k\varphi, c_{kl}\partial_l\varphi)$ a quadratic form on $L_2(\Omega)$ with domain $C_c^\infty(\Omega)$ where the $c_{kl}$ are real symmetric $L_\infty(\Omega)$-functions with $C(x)=(c_{kl}(x))>0$ for almost all $x\in \Omega$. Further assume there are $a, \delta>0$ such that $a^{-1}d_\Gamma^{\delta}\,I\le C\le a\,d_\Gamma^{\delta}\,I$ for $d_\Gamma\le 1$ where $d_\Gamma$ is the Euclidean distance to the boundary $\Gamma$ of $\Omega$. We assume that $\Gamma$ is Ahlfors $s$-regular and if $s$, the Hausdorff dimension of $\Gamma$, is larger or equal to $d-1$ we also assume a mild uniformity property for $\Omega$ i…

Boundary (topology)01 natural sciencesAhlfors regularityCombinatoricsMarkov uniquenessMathematics - Analysis of PDEsHardy inequalityFOS: MathematicsUniqueness0101 mathematicsMathematicsDiscrete mathematicsDirichlet formApplied Mathematicsta111010102 general mathematicsNeighbourhood (graph theory)Lipschitz continuity47D07 35J70 35K65010101 applied mathematicsQuadratic formHausdorff dimensionDomain (ring theory)AnalysisAnalysis of PDEs (math.AP)
researchProduct

Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm

2019

Abstract In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows and (constant) travel times. Second, we show that, if the special conditions do not hold, the time-independent optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. Finally, a branch-and-bound algorithm is presented and tested on a set of 4800 instances. The results have been compared…

Branch-and-boundApplied MathematicsTime dependenceUpper and lower boundsTravelling salesman problemSet (abstract data type)Traveling salesman problemExact algorithmTime windowsLower and upper boundTime windowDiscrete Mathematics and CombinatoricsApplied mathematicsConstant (mathematics)Discrete Mathematics and CombinatoricMathematics
researchProduct

Search for CP violation using T-odd correlations in D-0 -> K+K-pi(+)pi(-) decays

2014

A search for $CP$ violation using $T$-odd correlations is performed using the four-body $D^0 \to K^+K^-\pi^+\pi^-$ decay, selected from semileptonic $B$ decays. The data sample corresponds to integrated luminosities of $1.0\,\text{fb}^{-1}$ and $2.0\,\text{fb}^{-1}$ recorded at the centre-of-mass energies of 7 TeV and 8 TeV, respectively. The $CP$-violating asymmetry $a_{CP}^{T\text{-odd}}$ is measured to be $(0.18\pm 0.29\text{(stat)}\pm 0.04\text{(syst)})\%$. Searches for $CP$ violation in different regions of phase space of the four-body decay, and as a function of the $D^0$ decay time, are also presented. No significant deviation from the $CP$ conservation hypothesis is found.

CP violation Charm physics Hadron-Hadron Scattering Flavor physics14.40.Lb01 natural sciencesSettore FIS/04 - Fisica Nucleare e SubnucleareHigh Energy Physics - ExperimentFlavor physics[PHYS.HEXP]Physics [physics]/High Energy Physics - Experiment [hep-ex]ASTRONOMY & ASTROPHYSICSQCmedia_commonCharm physicsPhysicsHadronic decays of charmed mesonCharm physics; CP violation; Flavor physics; Hadron-Hadron ScatteringPhysicsPHYSICS PARTICLES & FIELDSParticle physicsCharge conjugation parity time reversal and other discrete symmetrieDecay timeCP violationPhysical Sciences13.25.FtCP violationFísica nuclearLHCParticle Physics - ExperimentTRIPLE-PRODUCT CORRELATIONSPACS: 13.25.Ft 11.30.ErCharm physicNuclear and High Energy PhysicsParticle physicsmedia_common.quotation_subjectLHCb - Abteilung HofmannHadronsAsymmetryNONuclear physicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0103 physical sciencesPiSDG 7 - Affordable and Clean Energy010306 general physicsLarge Hadron Collider (France and Switzerland)Science & Technology/dk/atira/pure/sustainabledevelopmentgoals/affordable_and_clean_energyHadron-Hadron Scatteringhep-ex010308 nuclear & particles physicsGran Col·lisionador d'HadronsCharm physics; CP violation; Flavor physics; Hadron-Hadron Scattering; Nuclear and High Energy PhysicsBABAR detectorHEPANGULAR-CORRELATIONSLHCbFlavor physicPhase spaceBaBar11.30.ErFísica de partículesExperimentsCharmed mesons (|C|>0 B=0)
researchProduct